Generating Orchestral Sequences with Timbral Descriptors

International audienc

i-Berlioz: Towards Interactive Computer-Aided Orchestration with Temporal Control

No embargo requiredThis paper introduces i-Berlioz, a proof-of-concept interactive Computer Aided Orchestration (CAO) system that suggests combinations of musical instruments to produce timbres specified by the user by means of verbal descriptors. The system relies on machine learning for timbre classification and generative orchestration, and tools to write and execute interactive scenarios. The paper details the two main parts of i-Berlioz: its generative and exploratory engines, respectively, accompanied with examples. The authors discuss how i-Berlioz can aid the composition of musical form based on timbre

Foundations for Reliable and Flexible Interactive Multimedia Scores

International audienceInteractive Scores (IS) is a formalism for composing and performing interactive multimedia scores with several applications in video games, live performance installations, and virtual museums. The composer defines the temporal organization of the score by asserting temporal relations (TRs) between temporal objects (TOs). At execution time, the performer may modify the start/stop times of the TOs by triggering interaction points and the system guarantees that all the TRs are satisfied. Implementations of IS and formal models of their behavior have already been proposed, but these do not provide usable means to reason about their properties. In this paper we introduce ReactiveIS, a programming language that fully captures the temporal structure of IS during both composition and execution. For that, we propose a semantics based on tree-like structures representing the execution state of the score at each point in time. The semantics captures the hierarchical aspects of IS and provides an intuitive representation of their execution. We also endow ReactiveIS with a logical semantics based on linear logic, thus widening the reasoning techniques available for IS. We show that ReactiveIS is general enough to capture the full behavior of IS and that it provides declarative ways to increase IS expressivity with, for instance, conditional statements and loops

Multi-triangulations as complexes of star polygons

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of looking at $k$-triangulations, namely as complexes of star polygons. With this tool we give new, direct, proofs of the fundamental properties of $k$-triangulations, as well as some new results. This interpretation also opens-up new avenues of research, that we briefly explore in the last section.Comment: 40 pages, 24 figures; added references, update Section

Concurrent Constraints Models for Specifying Interactive Scores

(Abstract to follow